On a Reduced Load Equivalence for Fluid Queues Under Subexponentiality

نویسندگان

  • Rajeev Agrawal
  • Armand M. Makowski
  • Philippe Nain
چکیده

We propose a general framework for obtaining asymptotic distributional bounds on the stationary backlog WA1+A2;c in a bu er fed by a combined uid process A1 + A2 and drained at a constant rate c. The uid process A1 is an (independent) on-o source with average and peak rates 1 and r1, respectively, and with distribution G for the activity periods. The uid process A2 of average rate 2 is arbitrary but independent of A1. These bounds are used to identify subexponential distributions G and fairly general uid processes A2 such that the asymptotic equivalence P WA1+A2;c > x P WA1;c 2 > x (x ! 1) holds under the stability condition 1+ 2 < c and under the non-triviality condition c 2 < r1. The stationary backlog WA1;c 2 in these asymptotics results from feeding source A1 into a bu er drained at reduced rate c 2. This reduced load asymptotic equivalence extends to a larger class of distributions G a result obtained by Jelenkovic and Lazar [18] in the case when G belongs to the class of regular intermediate varying distributions. This work was performed in part while R. Agrawal was visiting INRIA during the Spring of 1997 and while A. M. Makowski was visiting INRIA during the academic year 1997/98. yThe work of this author was funded in part by the National Science Foundation under grant NCR-93-05018. zThe work of this author was supported partially through NSF Grant NSFD CDR-88-03012, NASA Grant NAGW77S, the Army Research Laboratory under Cooperative Agreement No. DAAL01-96-2-0002 and through the Maryland Procurement O ce under Grant No. MDA90497C3015. 0

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic behavior of Generalized Processor Sharing queues under subexponential hypothesis

Abstract: We analyze the behavior of Generalized Processor Sharing (GPS) queues with heavy-tailed service times. We compute the exact tail asymptotics of the stationary workload of an individual class and give new conditions for reduced-load equivalence and induced burstiness to hold. We also show that both phenomena can occur simultaneously. Our proofs rely on the single big event theorem and ...

متن کامل

Asymptotic behavior of generalized processor sharing queues under subexponential assumptions

We analyze the behavior of Generalized Processor Sharing (GPS) queues with heavy-tailed service times. We compute the exact tail asymptotics of the stationary workload of an individual class and give new conditions for reduced-load equivalence and induced burstiness to hold. We also show that both phenomena can occur simultaneously. Our proofs rely on the single big event theorem and new fluid ...

متن کامل

Reduced Load Equivalence under Subexponentiality

The stationary workload W A+B of a queue with capacity φ loaded by two independent processes A and B is investigated. When the probability of load deviation in process A decays slower than both in B and e √ , we show that W A+B is asymptotically equal to the reduced load queue W A , where b is the mean rate of B. This complements the known result that this property does not hold when both proce...

متن کامل

Reduced-Load Equivalence for Queues with Gaussian Input

In this note, we consider a queue fed by a number of independent heterogeneous Gaussian sources. We study under what conditions a reduced load equivalence holds, i.e., when a subset of the sources becomes asymptotically dominant as the buffer size increases. For this, recent results on extremes of Gaussian processes [6] are combined with de Haan theory. We explain how the results of this note r...

متن کامل

Probability , Networks and Algorithms Reduced - load equivalence for queues with Gaussian input

In this note, we consider a queue fed by a number of independent heterogeneous Gaussian sources. We study under what conditions a reduced load equivalence holds, i.e., when a subset of the sources becomes asymptotically dominant as the buffer size increases. For this, recent results on extremes of Gaussian processes are combined with de Haan theory. We explain how the results of this note relat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Queueing Syst.

دوره 33  شماره 

صفحات  -

تاریخ انتشار 1999